153 research outputs found

    Should you Allow your Students to Grade their own Homework?

    Get PDF
    Allowing students to grade their own homework promises several advantages to both students and instructors. But does such a policy make sense? This paper reports the results of an experiment in which eight separate assignments completed by approximately 80 students were first graded by the students using a grading rubric, and then re-graded by a teaching assistant, using this same rubric. The study found that the differences observed in the two sets of data were statistically significant, but (in the author’s opinion) acceptably small. The study also confirmed observations by earlier researchers that students who generously grade their work tend to fall among the lower-performing individuals in a class

    Five Data Validation Cases

    Get PDF
    Data-validation routines enable computer applications to test data to ensure their accuracy, completeness, and conformance to industry or proprietary standards. This paper presents five programming cases that require students to validate five different types of data: (1) simple user data entries, (2) UPC codes, (3) passwords, (4) ISBN numbers, and (5) credit card numbers

    A First Case Project in Visual Basic.Net: Preparing an Income Tax Return

    Get PDF
    Most commercial programming applications are considerably more complex than the end-of-chapter exercises found in programming textbooks. This case addresses this problem by requiring the students in an entry-level Visual Basic programming class to create an application that helps users prepare their U.S. income tax returns. For convenience, the forms in this project are simplified versions of some of the tax forms that a U.S. taxpayer would use to complete a real income tax return-i.e., Schedules A, B, and C, as well as a Child Care worksheet and a Schedule 1040. Although integrative in nature, the case does not require advanced programming skills, is useful as an interim class assignment, and can be completed using either VB.6 or VB.Net

    A Term Project in Visual Basic: The Downhill Snowboard Shop

    Get PDF
    Most commercial programming applications are considerably more complex than the end-of-chapter exercises found in programming textbooks. This case addresses this problem by requiring the students in entry-level Visual Basic programming classes to create an application that helps users order ski equipment from a retailer. For convenience, the forms in this project are simplified versions of what users might actually see in a shopping cart application. Although integrative in nature, the case does not require advanced programming skills. However, it requires familiarity with data and control arrays, formatting, loop controls, and parsing, as well as considerable documentation. It is therefore most suitable as an integrative term project. The required tasks can be completed using either VB.6 or VB.Net

    Playing Jeopardy in the Classroom: An Empirical Study

    Get PDF
    Playing TV game shows such as Jeopardy or Survivor in the classroom can be fun. But does it improve student understanding of course concepts? To find out, the author conducted eight experimental trials in five separate undergraduate information systems classes. Although he found limited improvement in student learning, the author’s experiences with the game and the results of a student survey were positive

    A New Look at Earmarking

    Get PDF
    Earmarking has been both praised and denounced as a fi cal tool of state government, 1 but there appears to be little scholarly research to either support or refute the arguments put forth in the dedication controversy. This paper attempts to weigh the evidence both for and against special funding, and to suggest some long-run planning corrections which would serve as a remedy to some specific problems often encountered in t he earmarking process. Dr. Simkin is an Associate Professor in the College of Business at the University of Hawaii

    The Design, Development, And Evaluation Of Database Projects In Accounting Classes

    Get PDF
    This paper describes a comprehensive database term project and several ideas that instructors can use to facilitate good projects and streamline the grading process.  The author tested the effectiveness of this assignment with an end-of-semester student survey, a comparison of group-versus-individual project performance, and an examination of his end-of-semester course evaluations.  His analyses suggest that term projects are an effective way to help students learn database concepts, and therefore should be included among the “best practices” associated with teaching database subjects

    An Experimental Study of the Effectiveness of Collaborative Testing in an Entry-Level Computer Programming Class

    Get PDF
    In collaborative testing environments, students work together in small groups to answer examination questions. This study tested the hypothesis that group exams help student testing performance in IS classes. Quantitative and qualitative analyses of student scores on two examinations (a quiz and a formal, extensive midterm) found significantly higher group scores (compared to individual scores), and that superior group performance was particularly notable for the constructed-response portion of the midterm. Both direct observation of the group process and a survey of student perceptions about the group exam process suggested that there were (1) few of the behavioral problems often attributed to group exams, (2) objective conflict resolution, and (3) favorable student perceptions of the process itself. This paper also provides several caveats that should be considered when interpreting these findings and suggests several avenues for future research

    Continuously non-malleable codes with split-state refresh

    Get PDF
    Non-malleable codes for the split-state model allow to encode a message into two parts, such that arbitrary independent tampering on each part, and subsequent decoding of the corresponding modified codeword, yields either the same as the original message, or a completely unrelated value. Continuously non-malleable codes further allow to tolerate an unbounded (polynomial) number of tampering attempts, until a decoding error happens. The drawback is that, after an error happens, the system must self-destruct and stop working, otherwise generic attacks become possible. In this paper we propose a solution to this limitation, by leveraging a split-state refreshing procedure. Namely, whenever a decoding error happens, the two parts of an encoding can be locally refreshed (i.e., without any interaction), which allows to avoid the self-destruct mechanism. An additional feature of our security model is that it captures directly security against continual leakage attacks. We give an abstract framework for building such codes in the common reference string model, and provide a concrete instantiation based on the external Diffie-Hellman assumption. Finally, we explore applications in which our notion turns out to be essential. The first application is a signature scheme tolerating an arbitrary polynomial number of split-state tampering attempts, without requiring a self-destruct capability, and in a model where refreshing of the memory happens only after an invalid output is produced. This circumvents an impossibility result from a recent work by Fuijisaki and Xagawa (Asiacrypt 2016). The second application is a compiler for tamper-resilient RAM programs. In comparison to other tamper-resilient compilers, ours has several advantages, among which the fact that, for the first time, it does not rely on the self-destruct feature

    Interactive Non-Malleable Codes Against Desynchronizing Attacks in the Multi-Party Setting

    Get PDF
    Interactive Non-Malleable Codes were introduced by Fleischhacker et al. (TCC 2019) in the two party setting with synchronous tampering. The idea of this type of non-malleable code is that it "encodes" an interactive protocol in such a way that, even if the messages are tampered with according to some class F of tampering functions, the result of the execution will either be correct, or completely unrelated to the inputs of the participating parties. In the synchronous setting the adversary is able to modify the messages being exchanged but cannot drop messages nor desynchronize the two parties by first running the protocol with the first party and then with the second party. In this work, we define interactive non-malleable codes in the non-synchronous multi-party setting and construct such interactive non-malleable codes for the class F^s_bounded of bounded-state tampering functions
    • …
    corecore